Impossibilities for roommate problems
نویسنده
چکیده
We establish three impossibility results for roommate problems. First, no single valued solution is Pareto optimal and anonymous. Next, no solution satisfies Pareto optimality, anonymity and converse consistency. Finally, no pseudo refinement of the core satisfies consistency. ∗This research dates back to 2001, when I was a visiting graduate student at the University of Rochester. I owe special thanks to William Thomson. I thank Burak Can and Bettina Klaus for their helpful comments. A preliminary version of this paper has been presented at the 30 Bosphorus Workshop on Economic Design, Bodrum, 2008, and at the Annual Meeting of Association of Southern European Economic Theorists (ASSET), İstanbul, 2009. I thank the participants for several useful comments. †İstanbul Bilgi University, Department of Economics, 34440 Dolapdere, İstanbul, Turkey; e-mail: [email protected]
منابع مشابه
Absolutely Stable Roommate Problems
Different solution concepts (core, stable sets, largest consistent set, ...) can be defined using either a direct or an indirect dominance relation. Direct dominance implies indirect dominance, but not the reverse. Hence, the predicted outcomes when assuming myopic (direct) or farsighted (indirect) agents could be very different. In this paper, we characterize absolutely stable roommate problem...
متن کاملCentre de Referència en Economia Analítica
We consider one-to-one matching (roommate) problems in which agents (students) can either be matched as pairs or remain single. The aim of this paper is twofold. First, we review a key result for roommate problems (the “lonely wolf” theorem) for which we provide a concise and elementary proof. Second, and related to the title of this paper, we show how the often incompatible concepts of stabili...
متن کاملA Review of the Existence of Stable Roommate Matchings
We compare different preference restrictions that ensure the existence of a stable roommate matching. Some of these restrictions are generalized to allow for indifferences as well as incomplete preference lists, in the sense that an agent may prefer remaining single to matching with some agents. We also introduce a new type of cycles and in greater detail investigate the domain of preferences t...
متن کاملNP-Complete Stable Matching Problems
This paper concerns the complexity analysis of the roommate problem and intern assignment problem with couples. These are two special cases of the matching problems known as stable matching. The roommate problem is that of assigning a set of people to rooms of exactly two occupants in accordance with the preferences of the members of the set. The intern assignment problem with couples is that o...
متن کاملThe stability of the roommate problem revisited
The lack of stability in some matching problems suggests that alternative solution concepts to the core might be a step towards furthering our understanding of matching market performance. We propose absorbing sets as a solution for the class of roommate problems with strict preferences. This solution, which always exists, either gives the matchings in the core or predicts other matchings when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Social Sciences
دوره 59 شماره
صفحات -
تاریخ انتشار 2010